The Resolution of Niho’s Last Conjecture Concerning Sequences, Codes, and Boolean Functions
نویسندگان
چکیده
A new method is used to resolve a long-standing conjecture of Niho concerning the crosscorrelation spectrum pair maximum length linear recursive sequences 2 2m -1 with relative decimation d=2 xmlns:xlink="http://www.w3.org/1999/xlink">m+2 -3, where m even. The result indicates that there are at most five distinct values. Equivalently, values in Walsh power permutation f(x)=x xmlns:xlink="http://www.w3.org/1999/xlink">d over finite field order and nonzero weights cyclic code two primitive nonzeros ? . obtain this proves constraints on number roots certain seventh degree polynomials can have unit circle field. also works when odd, which case associated spectra six
منابع مشابه
Boolean Functions from AG-Codes
Propagation criterion of degree l and order k (PC(l) of order k) and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1, 2, 3, 6, 7,8,10,11,16]. Kurosawa , Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, algebraic-geometric codes over GF (2) are used to modif...
متن کاملCryptographical Boolean Functions Construction from Linear Codes
This paper presents an extension of the Maiorana-McFarland method for building Boolean functions with good cryptographic properties. The original Maiorana-McFarland construction was proposed to design bent functions. Then, it was extended in [1] to build highly nonlinear resilient functions. The classical construction splits the set of variables into two separate subsets. There, is proposed a d...
متن کاملA Note on a Conjecture Concerning Symmetric Resilient Functions
In 1985, Chor et al 2] conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. In this note the existence of symmetric resilient functions is shown to be equivalent to the existence of a solution to a simultaneous subset sum problem. Then, using arithmetic properties of certain binomial coeecients, an innnite class of counterexamples t...
متن کاملMaximum Cellular Boolean Functions and Perfect Gray Codes
I. A Boolean function of n variables, considered as a subset of t he discl'cLe uni t n-cube Bn> is called cellular if each of its connected components is a face of Bn. Hammin g'~ determination of optimal binary single-error-detectin g codes is generalized to a characteri zation of all propel' cellular functions with the greatest possible number of clements . II. An analysis is made of a class o...
متن کاملOn Self-Dual Quantum Codes, Graphs, and Boolean Functions
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes with high minimum distance can be described as nested regular graphs having minimum regular vertex degree and containing long cycles. Two graphs correspond ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3098342